/**
*      author: Y_Yao
*      created: 2024-11-22 12:41:08
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
float a[N];
float n;

void solve()
{
    unordered_map<float,vector<int>> hash;
    cin >> n;
    for(int i = 1;i <= n; i++)
    {
        cin >> a[i];
        hash[a[i]].push_back(i);
    }
    float cur = n - 2;
    int flag = 0;
    for(int i = 1;i <= n;i++)
    {
        if(hash.count(cur / a[i]))
        {
            for(auto e : hash[cur / a[i]])
            {
                if(e != i)
                {
                    cout << a[i] << " " << a[e] << endl;
                    flag = 1;
                    break;
                }
            }
        }
        if(flag == 1) break;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}